BRAVO for Many-Server QED Systems with Finite Buffers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate analysis of single-server tandem queues with finite buffers

In this paper we study single-server tandem queues with general service times and finite buffers. Jobs are served according to the Blocking-After-Service protocol. To approximately determine the throughput and mean sojourn time, we decompose the tandem queue into single-buffer subsystems, the service times of which include starvation and blocking, and then iteratively estimate the unknown param...

متن کامل

CDMA Unslotted ALOHA Systems with Finite Buffers

CDMA unslotted ALOHA system with finite size of queueing buffers is discussed. We introduce an analytical model in which the system is divided into two Markov chains; one is in user part, and the other is in channel part. We analyze the system performance using this analytical model, and evaluate the effect of buffer capacity in terms of the throughput, the rejection probability and the average...

متن کامل

Fluid limits for many-server systems with reneging

A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by Kaspi and Ramanan, the Law-of-Large-Numbers many-server asymptotics are characterized as the unique solution to a set of...

متن کامل

FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

متن کامل

Stochastic Production Systems: Production and Maintenance Scheduling with Finite Buffers

Consider the production of a single consumable product that is fabricated in a process of stages that is subject to an uncertain environment. There are a number of workstations on each stage that have different operating parameters. The workstations are subject to the discrete events of repair, failure, and preventive maintenance that generate a jump in the state of the system. Between each sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Probability

سال: 2015

ISSN: 0001-8678,1475-6064

DOI: 10.1239/aap/1427814589